Packing Chromatic Number of Base-3 Sierpiński Graphs
نویسندگان
چکیده
The packing chromatic number (G) of a graph G is the smallest integer k such that there exists a k-vertex coloring of G in which any two vertices receiving color i are at distance at least i + 1. Let S be the base-3 Sierpiński graph of dimension n. It is proved that (S ) = 3, (S ) = 5, (S ) = (S ) = 7, and that 8 ≤ (S ) ≤ 9 holds for any n ≥ 5.
منابع مشابه
On packing chromatic number of subcubic outerplanar graphs
The question of whether subcubic graphs have finite packing chromatic number or not is still open although positive responses are known for some subclasses, including subcubic trees, base-3 Sierpiski graphs and hexagonal lattices. In this paper, we answer positively to the question for some subcubic outerplanar graphs. We provide asymptotic bounds depending on structural properties of the weak ...
متن کاملA 2-parametric generalization of Sierpinski gasket graphs
Graphs S[n, k] are introduced as the graphs obtained from the Sierpiński graphs S(n, k) by contracting edges that lie in no triangle. The family S[n, k] is a previously studied class of Sierpiński gasket graphs Sn. Several properties of graphs S[n, k] are studied in particular, hamiltonicity and chromatic number.
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملOn the packing coloring of undirected and oriented generalized theta graphs
The packing chromatic number χρ(G) of an undirected (respectively, oriented) graph G is the smallest integer k such that its set of vertices V (G) can be partitioned into k disjoint subsets V1, . . . , Vk, in such a way that every two distinct vertices in Vi are at distance (respectively directed distance) greater than i in G for every i, 1 ≤ i ≤ k. The generalized theta graph Θ 1,..., p consis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 32 شماره
صفحات -
تاریخ انتشار 2016